parse tree

英 [pɑːz triː] 美 [pɑːrs triː]

网络  解析树; 分析树; 语法分析树; 剖析树; 语法树

计算机



双语例句

  1. Target parsing can be reasonably fast and does not generate a memory-consuming parse tree, but all events fire for all elements in the data.
    目标解析可以实现合理的速度并且不会生成消耗内存的解析树,但是在数据中为所有元素触发事件。
  2. Your application could do more interesting things with the parse tree.
    您的应用程序可以用解析树做更多有趣的事情。
  3. With everything you've done so far, however, you still don't have quite enough information to calculate the results of the arithmetic operation represented by this parse tree.
    即使到目前为止您已经执行了所有操作,但您仍然没有足够的信息来计算该解析树表示的算术运算的结果。
  4. You could accomplish this by visiting the nodes of the parse tree and consolidating similar adjacent nodes ( actor= "Tom Cruise" and actor= "Kelly McGillis", for example).
    您可以通过访问解析树的节点以及合并相似的相邻节点(例如,actor=“TomCruise”和actor=“KellyMcGillis”)来完成该工作。
  5. For HC, the parse tree represents an XPath.
    对于HC,该解析树表示一个XPath。
  6. A Doclet has a static start() method and takes the parse tree as an argument.
    Doclet有静态start()方法,并将解析树作为参数。
  7. Beautiful Soup is an HTML/ XML parser for Python that can turn even invalid markup into a parse tree.
    BeautifulSoup是一种面向Python语言的HTML/XML解析器,它甚至可以将无效的标记转换为解析树。
  8. Since they have access to the entire parse tree ( minus the actual method body), Doclets provide a handy mechanism to compile utility classes or compile reports on the code.
    因为它们有权访问整个解析树(除去实际方法主体),所以Doclet提供了一个简便机制来编译有关代码的实用程序类或报告。
  9. The DFA construction algorithm converts this parse tree into a set of states, as the previous column explains.
    如前一篇专栏文章中所解释的,DFA构造算法将该解析树转换成一组状态。
  10. Like the JDT, the CDT DOM uses a visitor pattern to interact with its parse tree.
    类似于JDT,CDTDOM使用一个访问者模板,以和它的剖析树状图交流。
  11. I'll note before we go any further that the terms parse tree and abstract syntax tree ( or AST) describe very similar grammatical structures.
    在我们继续之前,我要特别提一下,术语解析树和抽象语法树(或AST)描述了非常相似的语法结构。
  12. From the discussion in the last column, you may recall that the algorithm to construct a DFA expects a parse tree as input.
    从上一篇专栏文章所讨论的内容中,您可以回忆起,构造DFA的算法需要一棵解析树作为输入。
  13. Write client-side code to walk and evaluate the parse tree that's produced at runtime
    编写客户机端代码以遍历在运行时生成的解析树并对其求值
  14. To perform queries on the AST parse tree, the Java IDE uses a visitor pattern.
    要在AST剖析树上执行查询,JavaIDE使用了一个访问者模式。
  15. It expects the front end ( reread previous column for more on the front end and back end) to return a parse tree that contains all the XPaths to recognize.
    该算法期望前端(请重新阅读上一篇专栏文章以了解更多有关前端和后端的信息)返回一个包含所有要识别的XPath的解析树。
  16. The algorithm essentially computes all the possible stack configurations that could lead to a given node in the parse tree.
    该算法必须计算所有可能的、可通向解析树中给定节点的堆栈配置。
  17. In fact, the example parse tree you looked at previously is almost a valid Scheme program.
    实际上,前面所研究的解析树示例几乎就是一个合法的Scheme程序。
  18. It extracts command-line arguments and processes the parse tree.
    它抽取命令行参数,然后处理解析树。
  19. In the parse tree, it corresponds to hitting the END_MARK.
    在解析树中,它对应于命中ENDMARK。
  20. Working with a parse tree representation also makes debugging easy and speeds development time.
    使用解析树表示还会使调试变得更容易,并缩短开发时间。
  21. Picture of parse tree for a single integer expression
    单个整数表达式的解析树的图片
  22. Walking through the parse tree at runtime with a good debugger is another invaluable adjunct to understanding how tree building works in JJTree.
    使用好的调试器在运行时遍历解析树是另一个宝贵的辅助方法,它有助于理解树构建在JJTree中是如何工作的。
  23. That, as well as the placement and format of the node constructors, guarantees that the parse tree is generated in the proper conformation so that treewalking does the right thing.
    级联样式和节点构造的位置和格式保证了以正确的结构生成解析树,这样树遍历可以正确执行。
  24. The single quotation mark in front of the null list is used to tell Scheme that you are using() as data and not as a part of your parse tree.
    空列表前面的单引号用来告诉Scheme您正在使用()作为数据,而不是用它作为解析树的一部分。
  25. InfoQ: How did you make your technical choice like using parse tree for parsing and building AST Ruby?
    InfoQ:你如何做技术上的选择,比如解析使用parsetree,以及构建ASTRuby?
  26. InfoQ: Could you tell us the advantage of using JRuby over parse tree or any other solutions, to exploit Ruby code?
    InfoQ:你能告诉我们使用JRuby而不是parsetree或者其他解决方案来解析Ruby代码的优势吗?
  27. The first approach is to delay all semantic actions until the whole parse tree is constructed.
    第一种做法是延迟所有语意动作,直到建立完整的剖析树。
  28. This article compares the effects of different management measures on biomass and growth of larch by analyzing the parse tree based on researching the sample.
    本文在区域样地调查基础上,通过解析木分析,比较了不同经营措施对落叶松种群生物量和生长量的影响。
  29. InfoQ: With the ParseTree gem, one can access the parse tree of a class or method.
    InfoQ:我们可以使用ParseTreegem包访问一个类或一个方法的解析树。
  30. ParseTree is a library that allows to access the parse tree of Ruby code-either Ruby source code or Ruby code already loaded in the interpreter.
    ParseTree是一个用来访问Ruby代码解析树的程序库,这个Ruby代码可以是源代码,也可以是已经加载到解释器的代码(即实时访问)。